Blocking Gibbs sampling for linkage analysis in large pedigrees with many loops.
نویسندگان
چکیده
We apply the method of "blocking Gibbs" sampling to a problem of great importance and complexity-linkage analysis. Blocking Gibbs sampling combines exact local computations with Gibbs sampling, in a way that complements the strengths of both. The method is able to handle problems with very high complexity, such as linkage analysis in large pedigrees with many loops, a task that no other known method is able to handle. New developments of the method are outlined, and it is applied to a highly complex linkage problem in a human pedigree.
منابع مشابه
Blocking Gibbs Sampling in Very Large Probabilistic Expert Systems D Blocking Gibbs Sampling in Very Large Probabilistic Expert Systems
We introduce a methodology for performing approximate computations in very complex probabilistic systems (e.g. huge pedigrees). Our approach, called blocking Gibbs, combines exact local computations with Gibbs sampling in a way that complements the strengths of both. The methodology is illustrated on a real-world problem involving a heavily inbred pedigree containing 20;000 individuals. We pres...
متن کاملMultilocus linkage analysis by blocked Gibbs sampling
The problem of multilocus linkage analysis is expressed as a graphical model, making explicit a previously implicit connection, and recent developments in the field are described in this context. A novel application of blocked Gibbs sampling for Bayesian networks is developed to generate inheritance matrices from an irreducible Markov chain. This is used as the basis for reconstruction of histo...
متن کاملBlocking Gibbs sampling in very large probabilistic expert systems
We introduce a methodology for performing approximate computations in very complex probabilistic systems (e.g. huge pedigrees). Our approach, called blocking Gibbs, combines exact local computations with Gibbs sampling in a way that complements the strengths of both. The methodology is illustrated on a real-world problem involving a heavily inbred pedigree containing 20;000 individuals. We pres...
متن کاملOptimal peeling order for pedigrees with incomplete genotypic information
The likelihood approach is common in linkage analysis of large extended pedigrees. Various peeling procedures, based on the conditional independence of separate parts of a pedigree, are typically used for likelihood calculations. A peeling order may significantly affect the complexity of such calculations, particularly for pedigrees with loops or when many pedigrees members have unknown genotyp...
متن کاملAn algorithm to sample unobservable genotypes in complex pedigrees
Probability functions such as likelihoods and genotype probabilities play an important role in the analysis of genetic data. When genotype data are incomplete Markov chain Monte Carlo (MCMC) methods, such as the Gibbs sampler, can be used to sample genotypes at the marker and trait loci. The Markov chain that corresponds to the scalar Gibbs sampler may not work due to slow mixing. Further, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- American journal of human genetics
دوره 65 3 شماره
صفحات -
تاریخ انتشار 1999